Helly's first theorem

Helly's first theorem
French\ \ théorème première de Helly
German\ \ Erster Satz von Helly
Dutch\ \ eerste theorema van Helly
Italian\ \ primo teorema di Helly
Spanish\ \ primer teorema de Helly
Catalan\ \ primer teorema de Helly
Portuguese\ \ primeiro teorema de Helly
Romanian\ \ -
Danish\ \ -
Norwegian\ \ -
Swedish\ \ -
Greek\ \ πρώτο θεώρημα του Helly
Finnish\ \ Hellyn ensimmäinen teoreema
Hungarian\ \ Helly elsõ tétele
Turkish\ \ Helly'nin birinci teoremi; Helly'nin birinci savı
Estonian\ \ Helly esimene teoreem
Lithuanian\ \ -
Slovenian\ \ -
Polish\ \ pierwsze twierdzenie Helly'ego
Russian\ \ первая теорема Хэлли
Ukrainian\ \ -
Serbian\ \ -
Icelandic\ \ fyrsta Helly's setningin
Euskara\ \ Helly lehen teorema
Farsi\ \ -
Persian-Farsi\ \ -
Arabic\ \ النظرية الاولى لهلي
Afrikaans\ \ Helly se eerste stelling
Chinese\ \ 赫 利 第 一 定 理
Korean\ \ Helly 일차 정리

Statistical terms. 2014.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Helly's selection theorem — In mathematics, Helly s selection theorem states that a sequence of functions that is locally of bounded total variation and uniformly bounded at a point has a convergent subsequence. In other words, it is a compactness theorem for the space… …   Wikipedia

  • Helly's theorem — In geometry, Helly s theorem is a basic combinatorial result on convex sets. It was proved by Eduard Helly in 1923, and gave rise to the notion of Helly family.tatement of Helly s theorem:Suppose that::X 1,X 2,dots,X n :is a finite collection of… …   Wikipedia

  • Helly family — In combinatorics, a Helly family of order k is a family of sets such that any minimal subfamily with an empty intersection has k or fewer sets in it. In other words, any subfamily such that every (k+1) fold intersection is non empty has non empty …   Wikipedia

  • Helly–Bray theorem — In probability theory, the Helly–Bray theorem relates the weak convergence of cumulative distribution functions to the convergence of expectations of certain measurable functions. The first eponym is Eduard Helly. Let F and F 1, F 2, ... be… …   Wikipedia

  • Arzelà–Ascoli theorem — In mathematics, the Arzelà–Ascoli theorem of functional analysis gives necessary and sufficient conditions to decide whether every subsequence of a given sequence of real valued continuous functions defined on a closed and bounded interval has a… …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • Bounded variation — In mathematical analysis, a function of bounded variation refers to a real valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense. For a continuous function of a… …   Wikipedia

  • combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

  • Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… …   Wikipedia

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”